#define _CRT_SECURE_NO_WARNINGS 1
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
//class Solution {
//public:
//    int widthOfBinaryTree(TreeNode* root)
//    {
//        if (root == nullptr) return 0;
//        vector<pair<TreeNode*, unsigned long long>> v(1, make_pair(root, 0));
//        unsigned long long ret = 0;
//        while (!v.empty())
//        {
//            ret = max(ret, v[v.size() - 1].second - v[0].second + 1);
//            vector<pair<TreeNode*, unsigned long long>> tmp;
//            for (int i = 0;i < v.size();++i)
//            {
//                if (v[i].first->left != nullptr)
//                {
//                    tmp.push_back(make_pair(v[i].first->left, v[i].second * 2));
//                }
//                if (v[i].first->right != nullptr)
//                {
//                    tmp.push_back(make_pair(v[i].first->right, v[i].second * 2 + 1));
//                }
//            }
//            v = tmp;
//        }
//        return ret;
//    }
//};
#include <iostream>
using namespace std;
int main()
{
	unsigned long long a = 0;
	unsigned long long b = 0;
	int c = 2;
	if (c < a - b + 1)
	{
		cout << "!" << endl;
	}
	return 0;
}